Eulerian cycle

См. также в других словарях:

• Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the …   Wikipedia

• Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n …   Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

• De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A …   Wikipedia

• Kautz graph — Sample of K. graph with M=2: on the left N=1, on the right N=2.The edges of the left graph correspond to the nodes of right graph.The Kautz graph K M^{N + 1} is a directed graph of degree M and dimension N+1, which has (M +1)M^{N} vertices… …   Wikipedia

• Carl Hierholzer — (1840 September 13 1871) was a German mathematician.Hierholzer studied mathematics in Karlsruhe, and he got his PhD from Ruprecht Karls Universität Heidelberg in 1865. His PhD advisor was Ludwig Otto Hesse (1811–1874). In 1870 Hierholzer wrote… …   Wikipedia

• Route inspection problem — In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an… …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

• Theoretical ecology — Mathematical models developed in theoretical ecology predict complex food webs are less stable than simple webs.[1]:75–77[2]:64 …   Wikipedia